Two weight $\mathbb{Z}_{p^k}$-codes, $p$ odd prime
نویسندگان
چکیده
We show that regular homogeneous two-weight Z pk -codes where p is odd and k > 2 with dual Hamming distance at least four do not exist. The proof relies on existence conditions for the strongly regular graph built on the cosets of the dual code.
منابع مشابه
$\mathbb{Z}_p\mathbb{Z}_p[u]$-additive codes
Abstract: In this paper, we study ZpZp[u]-additive codes, where p is prime and u 2 = 0. In particular, we determine a Gray map from ZpZp[u] to Z α+2β p and study generator and parity check matrices for these codes. We prove that a Gray map Φ is a distance preserving map from (ZpZp[u],Gray distance) to (Z α+2β p ,Hamming distance), it is a weight preserving map as well. Furthermore we study the ...
متن کاملSkew cyclic codes over $\mathbb{F}_{p}+u\mathbb{F}_{p}$
In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta ]$-submodules of $R_{n}=R[x;\theta ]/\langle x^{n}-1\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an...
متن کاملConstacyclic codes of length $4p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Let p be an odd prime, s,m be positive integers and Fpm be the finite field with p m elements. In this paper, we determine all constacyclic codes of length 4p over the finite commutative chain ring R = Fpm + uFpm with unity, where u 2 = 0. We also determine their dual codes and list some isodual constacyclic codes of length 4p over R.
متن کامل$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-Linear Skew Constacyclic Codes
In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...
متن کاملSeveral Classes of Trace Codes With Either Optimal Two Weights or a Few Weights over $\mathbb{F}_{q}+u\mathbb{F}_{q}$
Abstract. Let p be a prime number, q = p for a positive integer s. For any positive divisor e of q− 1, we construct an infinite families codes of dimension 2m with few Lee-weight. These codes are defined as trace codes over the ring R = Fq + uFq, u 2 = 0. Using Gauss sums, their Lee weight distribution is provided. When gcd(e,m) = 1, we obtain an infinite family of two-weight codes which meet t...
متن کامل